Adaptive diversity combining for wide band code division multiple access (W-CDMA) based on iterative channel estimation

ABSTRACT

The present invention provides a method for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising:  
     splitting multi-path interference into I known  and I unknown  components,  
     precomputing said I known  interference components,  
     iteratively estimating channel interference after removing I known  components of the multi-path interference from the pilot symbols,  
     using the convergence/divergence of the iteration as an indicator of the channel condition, and  
     selecting the combining technique (MRC or EGC) automatically depending on the channel condition.  
     The instant invention also provides a system and configured computer program product for carrying out the above method.

FIELD OF THE INVENTION

[0001] This invention relates to Adaptive Diversity Combining for Wide Band Code Division Multiple Access (W-CDMA) based on Iterative Channel Estimation.

BACKGROUND OF THE INVENTION

[0002] Maximal Ratio Combining (MRC) is a technique used to combine the different multipath components from the fingers of a Rake Receiver in CDMA systems. In ideal conditions, MRC is known to provide better Signal to Interference Ratio (SIR) than Equal Gain Combining (EGC) which is another well understood combining technique.

[0003] However, MRC requires estimation of the channel impulse response. When the channel estimates are not reliable, as could happen in severe channel conditions, the performance of MRC degrades. With non-ideal channel estimates the performance of MRC can degrade below that of EGC. This is because EGC does not use any channel estimates for combining the paths and therefore its performance is independent of the channel conditions.

[0004] Channel Estimation is done on pilot symbols. In the downlink of W-CDMA, the only source of interference is the multipath interference. The pilot symbols are degraded by multipath interference. The level of degradation will depend on the level of multipath interference. Hence the reliability of the channel estimates too will depend on the level of multipath interference. Therefore for more reliable channel estimates to be obtained, the effect of multipath interference on the pilot symbols has to be removed.

[0005] It follows that a better receiver would be the one, which chooses its combining technique based on the channel conditions. The problem of the performance degradation of MRC due to non-ideal channel estimates has not been addressed so far.

THE OBJECT AND SUMMARY OF THE INVENTION

[0006] The object of this invention is to obviate this drawback.

[0007] To achieve the said objective, this invention provides a method for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising:

[0008] splitting multi-path interference into I_(known) and I_(unknown) components,

[0009] precomputing said I_(known) interference components,

[0010] iteratively estimating channel interference after removing I_(known) components of the multi-path interference from the pilot symbols,

[0011] using the convergence/divergence of the iteration as an indicator of the channel condition, and

[0012] selecting the combining technique (ARC or EGC) automatically depending on the channel condition.

[0013] EGC is selected if said iteration diverges and MRC is selected if it converges.

[0014] The precomputation of said I_(known) interference components is calculated by the following formulae $c_{l} = \frac{d_{l} - {\sum{c_{m}I_{known}}} - I_{unknown}}{S_{l,l}}$

[0015] where,

[0016] c_(l)=refined channel estimate of lth finger

[0017] d_(l)=de-spread data of lth finger

[0018] c_(m)=channel estimate of mth path

[0019] S_(ll)=signal component that will be received if no path other than path l is present

[0020] The refined channel estimates c_(l) ^(n) are obtained using the following iteration

c _(l) ^((n)) =d _(l)(j)−Σc _(m) ^((n−1)) I _(known)

[0021] where

[0022] c_(l) ^((n))=nth iterative value of channel estimate

[0023] d_(l)(j)=jth de-spread data of lth finger

[0024] c_(m) ^((n−1))=(n−1)th refined channel estimate of mth path

[0025] The said convergence of the iteration is monitored using the following formula

δ=|c _(l) ^((n)) −c _(l) ^((n−1))|

[0026] where

[0027] δ=convergence measurement parameter

[0028] c_(l) ^((n))=nth iterative value of channel estimate

[0029] c_(m) ^((n−1))=(n−1)th refined channel estimate of mth

[0030] An increasing value of convergence measurement parameter indicates a diverging iteration while a reducing value of convergence measurement parameter indicates a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ_(th) is fixed depending on the degree of refinement required for the channel estimates

δ<δ_(th)

[0031] where,

[0032] δ=convergence of iteration

[0033] δ_(th)=predefined threshold value of refinement required for channel estimate

[0034] The instant invention also provides a system for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising:

[0035] means for splitting multi-path interference into I_(known) and I_(unknown) components,

[0036] means for precomputing said I_(known) interference components,

[0037] means for iteratively estimating interference after removing I_(known) components of the multi-path interference from the pilot symbols,

[0038] means for monitoring the convergence/divergence of the iteration as an indicator of the channel condition, and

[0039] means for selecting the combining technique (MRC or EGC) automatically depending on the channel condition.

[0040] The said means for selecting chooses EGC if said iteration diverges and MRC if said iteration converges.

[0041] The means for precomputation of said I_(known) interference components uses following formulae $c_{l} = \frac{d_{l} - {\sum{c_{m}I_{known}}} - I_{unknown}}{S_{l,l}}$

[0042] where,

[0043] c_(l)=refined channel estimate of lth finger

[0044] d_(l)=de-spread data of lth finger

[0045] c_(m)=channel estimate of mth path

[0046] S_(ll)=signal component that will be received if no path other than path l is present

[0047] The said means for iterative estimation uses:

c _(l) ^((n)) =d _(l)(j)−Σc _(m) ^((n−1)) I _(known)

[0048] where

[0049] c_(l) ^((n))=nth iterative value of channel estimate

[0050] d_(l)(j)=jth de-spread data of lth finger

[0051] c_(m) ^((n−1))=(n−1)th refined channel estimate of mth path

[0052] The said means for monitoring uses:

δ=|c _(l) ^((n)) −c _(l) ^((n−1))|

[0053] where

[0054] =convergence of iteration

[0055] c_(l) ^((n))=nth iterative value of channel estimate

[0056] c_(m) ^((n−1))=(n−1)th refined channel estimate of mth

[0057] The said means for monitoring uses an increasing value of convergence measurement parameter to indicate a diverging iteration and a reducing value of convergence measurement parameter to indicate a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ_(th) is fixed depending on the degree of refinement required for the channel estimates

δ<δ_(th)

[0058] where,

[0059] δ=convergence of iteration

[0060] δ_(th)=predefined threshold value of refinement required for channel estimate

[0061] The invention further provides a computer program product comprising computer readable program code stored on computer readable storage medium embodied therein for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising:

[0062] computer readable program code means configured for splitting multi-path interference into I_(known) and I_(known) components,

[0063] computer readable program code means configured for precomputing said I_(known) interference components,

[0064] computer readable program code means configured for iteratively estimating interference after removing I_(known) components of the multi-path interference from the pilot symbols,

[0065] computer readable program code means configured for monitoring the convergence/divergence of the iteration as an indicator of the channel condition, and

[0066] computer readable program code means configured for selecting the combining technique (MRC or EGC) automatically depending on the channel condition.

[0067] The said computer readable program code means configured for selecting chooses EGC if said iteration diverges and MRC if said iteration converges.

[0068] The computer readable program code means configured for precomputation of said I_(known) interference components uses following formulae $c_{l} = \frac{d_{l} - {\sum{c_{m}I_{known}}} - I_{unknown}}{S_{l,l}}$

[0069] where,

[0070] c_(l)=refined channel estimate of lth finger

[0071] d_(l)=de-spread data of lth finger

[0072] c_(m)=channel estimate of mth path

[0073] S_(ll)=signal component that will be received if no path other than path l is present

[0074] The said computer readable program code means configured for iterative estimation uses:

c _(l) ^((n)) =d _(l)(j)−Σc _(m) ^((n−1)) I _(known)

[0075] where

[0076] c_(l) ^((n))=nth iterative value of channel estimate

[0077] d_(l)(j)=jth de-spread data of lth finger

[0078] c_(m) ^((n−1))=(n−1)th refined channel estimate of mth path

[0079] The said computer readable program code means configured for monitoring uses:

δ=|c _(l) ^((n)) −c _(l) ^((n−1))|

[0080] where

[0081] =convergence of iteration

[0082] c_(l) ^((n))=nth iterative value of channel estimate

[0083] c_(m) ^((n−1))=(n−1)th refined channel estimate of mth

[0084] The said computer readable program code means configured for monitoring uses an increasing value of convergence measurement parameter to indicate a diverging iteration and a reducing value of convergence measurement parameter to indicate a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ_(th) is fixed depending on the degree of refinement required for the channel estimates

δ<δ_(th)

[0085] where,

[0086] δ=convergence of iteration

[0087] δ_(th)=predefined threshold value of refinement required for channel estimate.

BRIEF DESCRIPTION OF THE DRAWING

[0088]FIG. 1 shows the flow diagram for adaptive diversity combining for wide band code division multiple access (W-CDMA) according to this invention.

DETAILED DESCRIPTION OF THE DRAWING

[0089] Referring to drawings, FIG. 1 illustrates adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising precomputing (2) I_(known) component of the multipath interference followed by iterative estimation of channel interference (3) after isolating said I_(known) components from the pilot symbols. EGC is selected (4) if said iteration diverges and MRC is selected (5) if it converges (6).

[0090] The j^(th) de-spread data from the l^(th) finger of a Rake receiver in a DS-CDMA system can be expressed as ${d_{l}(j)} = {\sum\limits_{j*L_{1}}^{{{({j + 1})}*L_{1}} - 1}{{u\left( K_{1} \right)}{g\left( K_{2} \right)}\left( {\sum{c_{m}{s\left( {k - \tau_{m}} \right)}}} \right)}}$

[0091] where, u is scrambling code, g is the spreading code c_(m)s the channel coefficients, τ_(m)s are the channel tap delays and s is the transmitted chirp. The channel is modelled as a tapped delay line. L₁ is the period of the walsh spreading code that is used and j is equal to the integral value of k/L₁. K₁ and K₂ are such that K₁=mod(k,L₁) and K₂=mod(k,L₂) where mod represents the modulo operator and L₂ is the period of the scrambling code that is used. The noise component is neglected.

[0092] Let $S_{i,l} = {\sum\limits_{j*L_{1}}^{{{({j + 1})}*L_{1}} - 1}{{u\left( K_{1} \right)}{g\left( K_{2} \right)}{s\left( {k - \tau_{l}} \right)}}}$ and $I_{l,{m{({\neq l})}}} = {\sum\limits_{j*L_{1}}^{{{({j + 1})}*L_{1}} - 1}{{u\left( K_{1} \right)}{g\left( K_{2} \right)}{s\left( {k - \tau_{m}} \right)}}}$ Then ${d_{l}(j)} = {{c_{l}{S_{l,l}(j)}} + {\sum\limits_{l \neq m}{c_{m}I_{l,m}}}}$

[0093] S_(ll) is the signal component that will be received if no path other than path l is present.

[0094] I_(l,m) is the interference on path I due to the existence of path m. Hence the actual received signal when a particular path component is de-spread can be expressed as the sum of signal from own path and the interference components from all other paths.

[0095] In the above equations τ_(m) denotes the delay produced by path m. These delay values are known from the output of a multipath searcher. With τ_(l) . . . τ_(N) being known, the only unknown term in these equations is the transmitted chirp s. It follows that if a continuous stream of pilot bits is transmitted, then the receiver will have knowledge of s and hence S_(l,l) and I_(l,m(≠l)) can be calculated for all l and all m≠l.

[0096] If the only channel in the downlink is a pilot stream and if the path profile is entirely known and if the noise component is neglected, the ideal channel estimation problem becomes the problem of solving a system of simultaneous equations as shown below. $\begin{bmatrix} {d_{1}(j)} \\ {d_{2}(j)} \\ \vdots \\ {d_{N}(j)} \end{bmatrix} = {\begin{bmatrix} {S_{1,1}(j)} & {I_{1,2}(j)} & \cdots & {I_{1,N}(j)} \\ {I_{2,1}(j)} & {S_{2,2}(j)} & \cdots & {I_{2,N}(j)} \\ \vdots & \vdots & \vdots & \vdots \\ I_{N{(j)}} & \cdots & \cdots & {S_{N,N}(j)} \end{bmatrix} \cdot \begin{bmatrix} {c_{1}(j)} \\ {c_{2}(j)} \\ \vdots \\ {c_{N}(j)} \end{bmatrix}}$

[0097] Hence for this case the channel coefficients can be determined exactly by solving the above system of equations.

[0098] In the actual scenario, a multitude of channels exist simultaneously in the downlink, carrying the data for multiple users. For multiple channels in the downlink, the above analysis has to be modified. For this case, the interference component is split into two, namely, I_(known) and I_(unknown) consists of all interference components that can be calculated at the mobile receiver with the knowledge of the multipath profile. This will include the self-interference due to same spreading code from other paths. It can also include the other channels in the downlink of which the mobile receiver has information, for example the auxiliary pilot channels. For each path, these components are clubbed under I_(knownn).

[0099] The multipath interference components caused by other users' spreading codes cannot be calculated by the mobile receiver as the spreading and scrambling codes are unknown. Also, if the number of paths detected by the searcher is less than the number of taps of the channel, the interference caused by the extra paths cannot be determined at the UE. Noise can also be considered as producing a form of interference. All these components are clubbed under I_(unknown) for all the paths. With this we have, ${d_{l}(j)} = {{c_{l}{S_{l,l}(j)}} + {\sum\limits_{l \neq m}{c_{m}I_{l,{m{({known})}}}}} + I_{l,{m{({unknown})}}}}$

[0100] The entire unknown interference on path l from path m, including the noise effect, is clubbed under the term I_(l,m(unknown)).

ITERATIVE CHANNEL ESTIMATION

[0101] From the above equations, $c_{l} = \frac{d_{l} - {\sum{c_{m}I_{known}}} - I_{unknown}}{S_{l,l}}$

[0102] I_(known) are pre-computed once the path-profile is known. The initial values of c_(l) for all l are obtained by

c _(l) ⁽⁰⁾ =d _(l)(j)|S _(l,l)(j)

[0103] Refined estimates c_(l) ^((n)) are obtained using the following iteration;

c _(l) ^((n)) =d _(l)(j)−Σc _(m) ^((n−1)) I _(known)

[0104] Convergence of the iteration is monitored using the term

δ=|c _(l) ^((n)) −c _(l) ^((n−1))|

[0105] If δ is increasing after a few iterations, then the iteration diverges. If δ is decreasing, the iteration converges. A converging iteration is stopped when the condition

δ<δ_(th)

[0106] is met. δ_(th) is fixed depending on the degree of refinement required for the channel estimates.

[0107] Convergence of the above iteration depends on the magnitude of I_(unknown) relative to I_(known). For small and intermediate values of I_(unknown) the iteration converges while for large values of I_(unknown) the iteration diverges.

[0108] The adaptive combining technique is derived from the observations made in the above two sections. These observations are listed below

[0109] When interference is high the channel estimates are bad and hence performance of MRC becomes worse than that of EGC

[0110] When unknown interference is high the channel estimates cannot be refined and the iterative estimation diverges.

[0111] From the above, it can be observed that if the iteration diverges then it is also likely that the MRC performance is degraded because of bad channel estimates. From these an iterative algorithm is obtained which is shown below. This algorithm selects the diversity combining technique depending on the channel conditions. If the channel is bad and the interference is high then it selects EGC. When the interference is low and the channel estimates are reliable, it selects MRC as the combining technique. 

1. A method for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising: splitting multi-path interference into I_(known) and I_(unknown) components, precomputing said I_(known) interference components, iteratively estimating channel interference after removing I_(known) components of the multi-path interference from the pilot symbols, using the convergence/divergence of the iteration as an indicator of the channel condition, and selecting the combining technique (MRC or EGC) automatically depending on the channel condition.
 2. A method as claimed in claim 1 wherein EGC is selected if said iteration diverges and MRC is selected if it converges.
 3. A method as claimed in claim 1 wherein precomputation of said I_(known) interference components is calculated by the following formulae $c_{l} = \frac{d_{l} - {\sum{c_{m}I_{known}}} - I_{unknown}}{S_{l,l}}$

where, c_(l)=refined channel estimate of lth finger d_(l)=de-spread data of lth finger c_(m)=channel estimate of mth path S_(ll)=signal component that will be received if no path other than path l is present.
 4. A method as claimed in claim 1 wherein refined channel estimates c_(l) ^(n) are obtained using the following iteration c _(l) ^((n)) =d _(l)(j)−Σc _(m) ^((n−1)) I _(known) where c_(l) ^((n))=nth iterative value of channel estimate d_(l)(j)=jth de-spread data of lth finger c_(m) ^((n−1))=(n−1)th refined channel estimate of mth path.
 5. A method as claimed in claim 1 wherein said convergence of the iteration is monitored using the following formula δ=|c _(l) ^((n)) −c _(l) ^((n−1))| where δ=convergence measurement parameter c_(l) ^((n))=nth iterative value of channel estimate c_(m) ^((n−1))=(n−1)th refined channel estimate of mth.
 6. A method as claimed in claim 1 wherein an increasing value of convergence measurement parameter indicates a diverging iteration while a reducing value of convergence measurement parameter indicates a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ_(th) is fixed depending on the degree of refinement required for the channel estimates δ<δ_(th) where, δ=convergence of iteration δ_(th)=predefined threshold value of refinement required for channel estimate.
 7. A system for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising: means for splitting multi-path interference into I_(known) and I_(unknown) components, means for precomputing said I_(known) interference components, means for iteratively estimating interference after removing I_(known) components of the multi-path interference from the pilot symbols, means for monitoring the convergence/divergence of the iteration as an indicator of the channel condition, and means for selecting the combining technique (MRC or EGC) automatically depending on the channel condition.
 8. A system as claimed in claim 7 wherein said means for selecting chooses EGC if said iteration diverges and MRC if said iteration converges.
 9. A system as claimed in claim 7 wherein means for precomputation of said I_(known) interference components uses following formulae $c_{l} = \frac{d_{l} - {\sum{c_{m}I_{known}}} - I_{unknown}}{S_{l,l}}$

where, c_(l)=refined channel estimate of lth finger d_(l)=de-spread data of lth finger c_(m)=channel estimate of mth path S_(ll)=signal component that will be received if no path other than path l is present.
 10. A system as claimed in claim 7 wherein said means for iterative estimation uses: c _(l) ^((n)) =d _(l)(j)−Σc _(m) ^((n−1)) I _(known) where c_(l) ^((n))=nth iterative value of channel estimate d_(l)(j)=jth de-spread data of lth finger c_(m) ^((n−1))=(n−1)th refined channel estimate of mth path.
 11. A system as claimed in claim 7 wherein said means for monitoring uses: δ=|c _(l) ^((n)) −c _(l) ^((n−1))| where =convergence of iteration c_(l) ^((n))=nth iterative value of channel estimate c_(m) ^((n−1))=(n−1)th refined channel estimate of mth.
 12. A system as claimed in claim 7 wherein said means for monitoring uses an increasing value of convergence measurement parameter to indicate a diverging iteration and a reducing value of convergence measurement parameter to indicate a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ_(th) is fixed depending on the degree of refinement required for the channel estimates δ<δ_(th) where, δ=convergence of iteration δ_(th)=predefined threshold value of refinement required for channel estimate.
 13. A computer program product comprising computer readable program code stored on computer readable storage medium embodied therein for adaptive diversity combining for Wide Band Code Division Multiple Access (W-CDMA) comprising: computer readable program code means configured for splitting multi-path interference into I_(known) and I_(unknown) components, computer readable program code means configured for precomputing said I_(known) interference components, computer readable program code means configured for iteratively estimating interference after removing I_(known) components of the multi-path interference from the pilot symbols, computer readable program code means configured for monitoring the convergence/divergence of the iteration as an indicator of the channel condition, and computer readable program code means configured for selecting the combining technique (MRC or EGC) automatically depending on the channel condition.
 14. A computer program product as claimed in claim 13 wherein said computer readable program code means configured for selecting chooses EGC if said iteration diverges and MRC if said iteration converges.
 15. A system as claimed in claim 13 wherein computer readable program code means configured for precomputation of said I_(known) interference components uses following formulae $c_{l} = \frac{d_{l} - {\sum{c_{m}I_{known}}} - I_{unknown}}{S_{l,l}}$

where, c_(l)=refined channel estimate of lth finger d_(l)=de-spread data of lth finger c_(m)=channel estimate of mth path S_(ll)=signal component that will be received if no path other than path l is present.
 16. A system as claimed in claim 13 wherein said computer readable program code means configured for iterative estimation uses: c _(l) ^((n)) =d _(l)(j)−Σc _(m) ^((n−1)) I _(known) where c_(l) ^((n))=nth iterative value of channel estimate d_(l)(j)=jth de-spread data of lth finger c_(m) ^((n−1))=(n−1)th refined channel estimate of mth path.
 17. A system as claimed in claim 13 wherein said computer readable program code means configured for monitoring uses: δ=|c _(l) ^((n)) −c _(l) ^((n−1))| where =convergence of iteration c_(l) ^((n))=nth iterative value of channel estimate c_(m) ^((n−1))=(n−1)th refined channel estimate of mth.
 18. A system as claimed in claim 13 wherein said computer readable program code means configured for monitoring uses an increasing value of convergence measurement parameter to indicate a diverging iteration and a reducing value of convergence measurement parameter to indicate a converging iteration and the iteration is stopped when the following condition is satisfied wherein δ_(th) is fixed depending on the degree of refinement required for the channel estimates δ<δ_(th) where, δ=convergence of iteration δ_(th)=predefined threshold value of refinement required for channel estimate. 